Stochastic Planning with Conflicting Temporal Logic Goals
نویسندگان
چکیده
We propose algorithms for agents in Markov Decision Processes that plan to maximally satisfy multiple, potentially conflicting, temporal logic goals. These agents (1) satisfy as many goals as possible; (2) prioritize more important goals; and (3) violate goals, if necessary, for the minimum possible duration. We demonstrate the behaviors of such agents in two simple domains.
منابع مشابه
Asymptotically Optimal Stochastic Motion Planning with Temporal Goals
This work presents a planning framework that allows a robot with stochastic action uncertainty to achieve a high-level task given in the form of a temporal logic formula. The objective is to quickly compute a feedback control policy to satisfy the task specification with maximum probability. A top-down framework is proposed that abstracts the motion of a continuous stochastic system to a discre...
متن کاملComplexity and approximation studies of finding polynomially bounded length plans for temporal goals
In this paper1 we consider the problem of planning with temporal goals, focussing on polynomially bounded length plans. Past results about complexity of planning are mostly about finding plans that take the world to one of several desired states, often described using a goal formula. We first consider goals expressed using linear temporal logic and analyze the complexity of planning with respec...
متن کاملComputational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent true after the sequence of actions. In many real-life planning problems, the goal is represented in a much more complicated temporal form: e.g., in addition to having a desired fluent true at the end, we may want to k...
متن کاملNon-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version)
Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be nondeterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictions on ou...
متن کاملCompilation of LTL Goal Formulas into PDDL
Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extended goals. We present a method for compiling LTL goal formulas into Planning Domain Definition Language (PDDL), which is handled by many AI planners. The compilation process first constructs a finite state machine representing a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.07448 شماره
صفحات -
تاریخ انتشار 2017